package com.da.javatest.leetCode;

/**
 * @author chenlida
 * @date 2019/1/17 17:54
 * @description
 */
public class Code598 {
    public int maxCount(int m, int n, int[][] ops) {
        for (int[] op : ops) {
            if (op[0] < m) {
                m = op[0];
            }
            if (op[1] < n) {
                n = op[1];
            }
        }
        return m * n;
    }
}
